\section{Conclusion}
\label{sec:conclusion}

Finding the Out-Degree of an algorithm tends to be a natural question to ask when an algorithm
is being analized because it helps to define it in a more formal and yet robust way. 
In our case, analizing HSP and using the construction proposed on \ref{sec:construction} to obtain
the Out-Degree of each element of a cloud of points, we can conclude that the maximum number of
HSP-neighbors is bounded by the number of vertices of an icosahedron, which means that the Out-Degree 
of each point using HSP is 12.
